Efficient State Space Search for Time Petri Nets

نویسنده

  • Johan Lilius
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eecient State Space Search for Time Petri Nets

Partial-order reduction methods provide a number of well studied methods that have been succesfully applied to the state-space explosion problem that arises when analysing state based models of concurrent and reactive systems. The techniques have mainly been studied within the context of untimed systems, in the context of real-time systems little progress has been made. The main problem seems t...

متن کامل

Structural Methods Applied to the Symbolic Analysis of Petri Nets

Symbolic techniques based on Binary Decision Diagrams have emerged as one of the possible strategies to overcome the state exposition problem in the analysis of systems modeled as Petri nets. The results on structural theory of Petri nets obtained in the last few decades can be used to improve the symbolic analysis and to alleviate the state exposition problem. Structural theory provides severa...

متن کامل

Planning via Petri Net Unfolding

The factored state representation and concurrency semantics of Petri nets are closely related to those of concurrent planning domains, yet planning and Petri net analysis have developed independently, with minimal and usually unconvincing attempts at cross-fertilisation. In this paper, we investigate and exploit the relationship between the two areas, focusing on Petri net unfolding, which is a...

متن کامل

State space computation and analysis of Time Petri Nets

The theory of Petri Nets provides a general framework to specify the behaviors of real-time reactive systems and Time Petri Nets were introduced to take also temporal specifications into account. We present in this paper a forward zone-based algorithm to compute the state space of a bounded Time Petri Net: the method is different and more efficient than the classical State Class Graph. We prove...

متن کامل

TCTL Model Checking of Time Petri Nets

We consider Time Petri Nets (TPN) for which a firing time interval is associated with each transition. State space abstractions for TPN preserving various classes of properties (LTL, CTL, CTL) can be computed, in terms of so called state classes. Some methods were proposed to check quantitative timed properties but are not suitable for effective verification of properties of real-life systems. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 1998